Searching for an item is a very important algorithm to a computer scientist. What makes computers tremendously valuable is their ability to store and search for information quickly and efficiently. For example, Internet search engines process billions of pages of information to help determine the most appropriate resources for users, and a word processor’s spell-checking feature enables quick searching of large dictionaries. In this lesson, you will learn about a simple sequential search and the very efficient binary search.
The key topics for this lesson are:
- Sequential Search
- Binary Search
- Recursive vs. Non-recursive Algorithms
|
